Sojourn Time Estimation in an M/G/∞ Queue with Partial Information

نویسندگان

  • Nafna Blanghaps
  • Yuval Nov
  • Gideon Weiss
چکیده

We propose an estimator for the CDF G of the sojourn time in a steady-state M/G/∞ queueing system, when the available data consists of the arrival and departure epochs alone, without knowing which arrival corresponds to which departure. The estimator is a generalization of an estimator proposed by Brown (1970), and is based on a functional relationship between G and the distribution of the time between a departure and the rth latest arrival preceding it. The estimator is shown to outperform Brown’s estimator, especially when the system is heavily loaded.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating mean sojourn time in the processor sharing M/G/1 queue with inaccurate job size information

We seek to approximate the mean sojourn time in the processor sharing M/G/1 queue with inaccurate job size information. Suppose we are given the arrival rate λ and random service time Ŝ = SX where X ∼ LN(0, σ) represents the inaccuracy. Denote the mean sojourn time in an M/G/1 queue with processor sharing with service time Ŝ by E(T̂) and with service time S by E(T). Finally, E(T̂) denotes the mea...

متن کامل

Commuting matrices in the queue length and sojourn time analysis of MAP/MAP/1 queues

Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and di erent representations for their stationary sojourn time and queue length distribution have been derived. More speci cally, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queue...

متن کامل

Explicit Formulas for the Moments of the Sojourn Time in the M/g/1 Processor Sharing Queue with Permanent Jobs

We give some representation about recent achievements in analysis of the M/G/1 queue with egalitarian processor sharing discipline (EPS). The new formulas are derived for the j-th moments (j ∈ N) of the (conditional) stationary sojourn time in the M/G/1—EPS queue with K (K ∈ 0 ∪ N) permanent jobs of infinite size. We discuss also how to simplify the computations of the moments.

متن کامل

Maximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)

This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...

متن کامل

Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals

For an M/G/1 processor-sharing queue with batch arrivals, Avrachenkov et al. [1] conjectured that the conditional mean sojourn time is concave. However, Kim and Kim [5] showed that this conjecture is not true in general. In this paper, we show that this conjecture is true if the service times have a hyperexponential distribution.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Applied Probability

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2013